Stationary tail asymptotics of a tandem queue with feedback
نویسندگان
چکیده
Motivated by applications in computer networks, in this talk, we consider a tandem queue with feedback.In this model, both the interarrival time and the service time are exponential. Upon completion of the service at thesecond station, the customer either leaves the system with probability p or goes back together with all customersin the second queue to the first queue with probability 1-p. We demonstrate how to use alpha-positivity to studystationary tail asymptotics of the queue lengths.References [1] Haque, L., Liu, L. and Zhao, Y.Q. (2004). Sufficient Conditions for a Geometric Tail in a QBD Process withCountably Many Levels and Phases, accepted by Stochastic Models.[2] Miyazawa, M. and Zhao, Y.Q. (2004). The Stationary Tail Asymptotics in the GI/G/1 Type Queue withCountably Many Background States, Adv. in Appl. Probab., 36(4), 1231-1251.
منابع مشابه
Exact asymptotics for a Lévy-driven tandem queue with an intermediate input
We consider a Lévy-driven tandem queue with an intermediate input assuming that its buffer content process obtained by a reflection mapping has the stationary distribution. For this queue, no closed form formula is known, not only for its distribution but also for the corresponding transform. In this paper we consider only light-tailed inputs, and derive exact asymptotics for the tail distribut...
متن کاملTail asymptotics for a Lévy-driven tandem queue with an intermediate input
We consider a Lévy-driven tandem queue with an intermediate input assuming that its buffer content process obtained by a reflection mapping has the stationary distribution. For this queue, no closed form formula is known, not only for its distribution but also for the corresponding transform. In this paper we consider only light-tailed inputs. For the Brownian input case, we derive exact tail a...
متن کاملCustomer sojourn time in GI/GI/1 feedback queue in the presence of heavy tails
We consider a single-server GI/GI/1 queueing system with feedback. We assume the service times distribution to be (intermediate) regularly varying. We find the tail asymptotics for a customer’s sojourn time in two regimes: the customer arrives in an empty system, and the customer arrives in the system in the stationary regime. In particular, in the case of Poisson input we use the branching pro...
متن کاملTail asymptotics for the queue length in an M/G/1 retrial queue
In this paper, we study the tail behavior of the stationary queue length of an M/G/1 retrial queue. We show that the subexponential tail of the stationary queue length of an M/G/1 retrial queue is determined by that of the corresponding M/G/1 queue, and hence the stationary queue length in an M/G/1 retrial queue is subexponential if the stationary queue length in the corresponding M/G/1 queue i...
متن کاملHeavy Tails in Multi-Server Queue
In this paper, the asymptotic behaviour of the distribution tail of the stationary waiting time W in the GI/GI/2 FCFS queue is studied. Under subexponential-type assumptions on the service time distribution, bounds and sharp asymptotics are given for the probability P{W > x}. We also get asymptotics for the distribution tail of a stationary two-dimensional workload vector and of a stationary qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 160 شماره
صفحات -
تاریخ انتشار 2008